منابع مشابه
Labeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملEmbeddings of Graphs
In this paper, we survey the metric properties of isometric subgraphs of hyper-cubes and, more generally, of`1-graphs. An`1-graph is a graph which is hypercube embeddable, up to scale. In particular, we present several characterizations for hy-percube embeddable graphs and a combinatorial algorithm (from Shp93]) permitting to recognizè 1-graphs in polynomial time. The link with the metric repre...
متن کاملAntipodal Embeddings of Graphs
An antipodal graph D of diameter d has the property that each vertex v has a unique (antipodal) vertex v at distance d from v in D. We show that any such D has circuits of length Id passing through antipodal pairs of vertices. The identification of antipodal vertex-pairs in D produces a quotient graph G with a double cover projection morphism p : D-+G. Using the two-fold quotient map of surface...
متن کاملBernoulli Embeddings for Graphs
Just as semantic hashing [Salakhutdinov and Hinton2009] can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for nodes in a graph. By imagining the embeddings as independent coin flips of varying bias, continuous optimization techniques can be...
متن کاملOn Isometric Embeddings of Graphs
If G is a finite connected graph with vertex set V and edge set E, a standard way of defining a distance da on G is to define dG(x, y) to be the number of edges in a shortest path joining x and y in V. If (M, dM) is an arbitrary metric space, then an embedding X: V-> M is said to be isometric if dG(x, y) = dM(\(x), X(y)) for all x, y e V. In this paper we will lay the foundation for a theory of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90142-8